Semi-definite Relaxation of Quadratic Assignment Problems based on Nonredundant Matrix Splitting
نویسندگان
چکیده
Quadratic Assignment Problems (QAPs) are known to be among the most challenging discrete optimization problems. Recently, a new class of semi-definite relaxation models for QAPs based on matrix splitting has been proposed [17, 20]. In this paper, we consider the issue of how to choose an appropriate matrix splitting scheme so that the resulting relaxation model can provide a strong bound. For this, we introduce a new notion of the so-called redundant and non-redundant matrix splitting. We show that the relaxation based on a non-redundant matrix splitting can provide a stronger bound than a redundant one. We then propose to follow the minimal trace principle to find such a non-redundant matrix splitting. Based on the minimal trace principle, three matrix splitting schemes are derived and coincidentally, two of them had already been used in [17, 20]. A new matrix splitting, called sum-matrix splitting, is introduced. A similar procedure as in [20] is used to construct the SDP relaxation model. Numerical experiments show the bound based on the sum-matrix splitting is very competitive with existing bounds including the bounds based on other matrix splitting schemes.
منابع مشابه
Semi-definite programming relaxation of quadratic assignment problems based on nonredundant matrix splitting
Quadratic Assignment Problems (QAPs) are known to be among the most challenging discrete optimization problems. Recently, a new class of semi-definite relaxation (SDR) models for QAPs based on matrix splitting has been proposed [25, 28]. In this paper, we consider the issue of how to choose an appropriate matrix splitting scheme so that the resulting relaxation model is easy to solve and able t...
متن کاملA new relaxation framework for quadratic assignment problems based on matrix splitting
Quadratic assignment problems (QAPs) are known to be among the hardest discrete optimization problems. Recent study shows that even obtaining a strong lower bound for QAPs is a computational challenge. In this paper, we first discuss how to construct new simple convex relaxations of QAPs based on various matrix splitting schemes. Then we introduce the so-called symmetric mappings that can be us...
متن کاملNew Convex Relaxations for Quadratic Assignment Problems
Quadratic assignment problems (QAPs) are known to be among the hardest discrete optimization problems. Recent study shows that even obtaining a strong lower bound for QAPs is a computational challenge. In this paper, we first discuss how to construct new simple convex relaxations of QAPs based on various matrix splitting schemes. Then we introduce the so-called symmetric mappings that can be us...
متن کاملEstimating Bounds for Quadratic Assignment Problems Associated with Hamming and Manhattan Distance Matrices Based on Semidefinite Programming
Quadratic assignment problems (QAPs) with a Hamming distance matrix of a hypercube or a Manhattan distance matrix of rectangular grids arise frequently from communications and facility locations and are known to be among the hardest discrete optimization problems. In this paper we consider the issue of how to obtain lower bounds for those two classes of QAPs based on semidefinite programming (S...
متن کاملAn Efficient Matrix Splitting Method for the Second-Order Cone Complementarity Problem
Given a symmetric and positive (semi)definite n-by-n matrix M and a vector, in this paper, we consider the matrix splitting method for solving the second-order cone linear complementarity problem (SOCLCP). The matrix splitting method is among the most widely used approaches for large scale and sparse classical linear complementarity problems (LCP), and its linear convergence is proved by [Luo a...
متن کامل